Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
نویسندگان
چکیده
منابع مشابه
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem extended abstract
Given a ground set L of labels and a collection of trees whose leaves are bijectively labelled by some elements of L, the Maximum Agreement Supertree problem (SMAST) is the following: find a tree T on a largest label set L ⊆ L that homeomorphically contains every input tree restricted to L. The problem finds applications in several fields, e.g. phylogenetics. In this paper we focus on the param...
متن کاملFixed Parameter Tractability and Treewidth 14 . 1 Fixed Parameter Tractability
One of the ways to cope with hard problems in practice is to realized that problem instances may be associated with some “parameters” related to their complexity. If the parameter of an instance is small, we might have some hope in finding a polynomial time solution to that instance. This idea has been investigated in the 1990’s by Downian and Fellowes in their work on fixed parameter tractabil...
متن کاملFixed-Parameter Tractability of almost CSP Problem with Decisive Relations
Let I be an instance of binary boolean CSP. Consider the problem of deciding whether one can remove at most k constraints of I such that the remaining constraints are satisfiable. We call it the Almost CSP problem. This problem is NP-complete and we study it from the point of view of parameterized complexity where k is the parameter. Two special cases have been studied: when the constraints are...
متن کاملScheduling Meets Fixed-Parameter Tractability
Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems. In this paper we present the first fixed-parameter algorithms for cla...
متن کاملFixed Parameter Tractability and Completeness
For many fixed-parameter problems that are trivially solvable in polynomial-time, such as k-Dominating Set, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as k-Feedback Vertex Set, exhibit fixed-parameter tractability: for each fixed k the problem is solvable in time bounded by a polynomial of degree c, where c is a const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics
سال: 2010
ISSN: 1545-5963
DOI: 10.1109/tcbb.2010.30